On optimal shooting intervals
نویسندگان
چکیده
منابع مشابه
The Shooting Approach to Optimal Control Problems
We give an overview of the shooting technique for solving deterministic optimal control problems. This approach allows to reduce locally these problems to a finite dimensional equation. We first recall the basic idea, in the case of unconstrained or control constrained problems, and show the link with second-order optimality conditions and the analysis or discretization errors. Then we focus on...
متن کاملCost-optimal quadtrees for ray shooting
Given a set S of objects, called a scene, the rayshooting problem asks, given a ray, what is the first object in S intersected by this ray. A popular approach to speed up ray-shooting queries is to construct a space decomposition such as a quadtree in 2D and an octree in 3D. The query is then answered by traversing the leaves of the tree as they are intersected by the ray, and for each cell in ...
متن کاملCost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applications, e.g., radio propagation simulation. Aronov and Fortune were the first to guarantee an overall performance within a constant factor of optimal in the following model of computation: build a triangulation compatib...
متن کاملGlobal optimal control with the direct multiple shooting method
Assumption 2 (Smoothness of the control problem) We assume that the function f : Rnx×nq 7→ Rx is sufficiently smooth. Note that Lipschitz continuity guarantees the unique existence of a solution x(·) of the differential equations for fixed q by virtue of the Picard-Lindelöf theorem. As we assume unique sensitivities in the following, also the partial derivative functions ∂f ∂x , ∂f ∂q , ∂f ∂x2 ...
متن کاملTraffic Network Optimal Scheduling Paths Based on Time Intervals Division
In order to make the network model was more fitting the actual condition of city traffic, this paper presents a dynamic transportation network model based on the traffic time division, and designs improved Dijkstra algorithm to solve the city traffic paths planning problem. Dijkstra algorithm is a typical singlesource shortest path algorithm is used to calculate a node to all other nodes in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1984
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1984-0725983-0